×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner
Vishnu S Reddy

Vishnu S Reddy

Love dogs, cars and programming.

Bangalore, India •
4 posts •
Data Structures

Different Self Balancing Binary Trees

A self-balancing binary tree is any tree that automatically keeps its height small in the face of arbitrary insertions and deletions on the tree. We have explored different types like 2 3 tree, Red Black tree, AVL Tree, B Tree, AA Tree, Scapegoat Tree, Splay Tree, Treap and Weight Balanced Tree.

Vishnu S Reddy Vishnu S Reddy
Data Structures

Introduction to 2-3 Trees

A 2-3 Tree is a tree data structure where every node with children has either two children and one data element or three children and two data elements. A node with 2 children is called a 2-NODE and a node with 3 children is called a 3-NODE.

Vishnu S Reddy Vishnu S Reddy
Data Structures

Introduction to AA trees

AA trees were introduced by Arne Andersson in 1993 and hence the name AA. They are a type of balanced binary search trees. It was developed as a simpler alternative to Red Black trees.

Vishnu S Reddy Vishnu S Reddy
Software Engineering

Complete guide on stdlib.h in C

is the header for the General Purpose Standard Library of C programming language which declares a variety of utility functions for type conversions, memory allocation, process control and other similar tasks.

Vishnu S Reddy Vishnu S Reddy
OpenGenus IQ © 2025 All rights reserved â„¢
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship