Courses
- For Working Professionals
- For Students
- Programming Languages
- Web Development
- Machine Learning and Data Science
  - Complete Data Science Program(Live)
  - Mastering Data Analytics
- New Courses
- School Courses
  - CBSE Class 12 Computer Science
  - School Guide
- All Courses
Tutorials
- DSA
- Data Structures
- Algorithms
- System Design
  - System Design Tutorial
  - Software Design Patterns
- Interview Corner
- Languages
  - C
  - C++
  - Java
  - Python
  - JavaScript
  - PHP
  - C#
  - SQL
  - Scala
  - Perl
  - Go Language
  - Kotlin
- Web Development
  - HTML
  - CSS
  - JavaScript
  - PHP
  - CSS Frameworks
  - JavaScript Frameworks
  - JavaScript Libraries
  - WordPress
  - JSON
- School Learning
  - English Grammar
  - School Programming
  - Mathematics
  - CBSE Syllabus
  - Maths Notes (Class 8-12)
  - Maths Formulas (Class 8 -11)
  - NCERT Solutions
  - RD Sharma Solutions
  - Science Notes
  - Physics Notes (Class 8-12)
  - Chemistry Notes (Class 8-12)
  - Biology Notes
  - Social Science Syllabus
  - Social Science Notes
    - SS Notes (Class 7-12)
    - CBSE History Notes (Class 7-10)
    - CBSE Geography Notes (Class 7-10)
    - CBSE Civics Notes (Class 7-10)
      - Civics Class 7
      - Civics Class 8
  - Commerce
  - CBSE Previous Year Papers
- ML & Data Science
  - Machine Learning
  - Data Science
- CS Subjects
- GATE
- GFG Sheets
  - Web Dev Cheat Sheets
  - Company-Wise SDE Sheets
  - DSA Sheets
- CS Exams/PSUs
  - ISRO
  - UGC NET
- Student
- UPSC
- SSC CGL
- Banking Exams
Jobs
Practice
Contests

Data Structures | Balanced Binary Search Trees | Question 10

Last Updated : 28 Jun, 2021

Read

Discuss

What is the worst case possible height of AVL tree?
(A) 2Logn
Assume base of log is 2

(B) 1.44log n
Assume base of log is 2

(C) Depends upon implementation
(D) Theta(n)

Answer: (B)

Explanation: See http://lcm.csa.iisc.ernet.in/dsa/node112.html

Quiz of this Question