Computer Science · Data Structures
एक अद्वितीय बाइनरी ट्री (unique binary tree) बनाने के लिए निम्नलिखित में से कौन सा ट्रैवर्सल युग्म पर्याप्त नहीं है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1पोस्टऑर्डर और प्रीऑर्डर (Postorder and Preorder)✓
- 2पोस्टऑर्डर और इनऑर्डर (Postorder and Inorder)
- 3प्रीऑर्डर और इनऑर्डर (Preorder and Inorder)
- 4इनऑर्डर और लेवल-ऑर्डर (Inorder and Level-order)
सही उत्तर देखें
पोस्टऑर्डर और प्रीऑर्डर (Postorder and Preorder)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures