Search questions…
⌘
K
English
Tiếng Việt
日本語
한국어
Español
العربية
বাংলা
čeština
Dansk
Deutsch
Ελληνικά
Suomi
Français
Gaeilge
ગુજરાતી
Hausa
हिन्दी
Hrvatski
Magyar
Bahasa Indonesia
Italiano
Basa Jawa
ქართული
Lietuvių
मराठी
Melayu
Malti
नेपाली
Nederlands
Norsk
ਪੰਜਾਬੀ
Polski
Português
Română
Русский
Slovenščina
Shqip
Svenska
Kiswahili
தமிழ்
తెలుగు
ภาษาไทย
Türkçe
اردو
简体中文
flow
Home
Topics
Categories
Learning paths
Search
Home
/
#Trees
#Trees
7 questions
What is a binary tree and what are the common traversal orders?
Data Structures
#data-structures
Middle
›
What is a binary search tree (BST) and what are its operation complexities?
Data Structures
#complexity
Middle
›
What is a heap and how does it implement a priority queue?
Data Structures
#data-structures
Middle
›
What is a trie (prefix tree) and when is it useful?
Data Structures
#data-structures
Middle
›
What are balanced BSTs (AVL and red-black trees) and why do they matter?
Data Structures
#complexity
Middle
›
What are B-trees and B+ trees and why do databases use them?
Data Structures
#complexity
Senior
›
How do segment trees and Fenwick trees (BIT) support fast range queries?
Data Structures
#complexity
Senior
›
Trees Interview Questions · IT Interview Practice