Skip to content
GATETECH

GATE CS Trees questions

Practise Trees questions for GATE CS. Explore official PYQs and original topic-wise quizzes, check answers and view available solutions. Free, no sign-in.

Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.

5 on this page
Official PYQ1991Programming and Data StructuresTreesNAT · 1 mark
The weighted external path length of the binary tree in figure is ______
Official PYQ1990Programming and Data StructuresTreesMCQ · 1 mark
The total external path length, EPL,\text{EPL}, of a binary tree with nn external nodes is, EPL=∑wIw\text{EPL}= \displaystyle \sum_{w} I_w, where IwI_{w} is the path length of external node ww),
Official PYQ1989Programming and Data StructuresTreesMSQ · 1 mark
Which one of the following statements (s) is/are FALSE?
Official PYQ1987Programming and Data StructuresTreesNAT · 1 mark
State whether the following statements are TRUE or FALSE: If the number of leaves in a tree is not a power of 2,2, then the tree is not a binary tree.
Official PYQ1987Programming and Data StructuresTreesNAT · 1 mark
State whether the following statements are TRUE or FALSE: It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?