Register

Self Doubt

• edited by
382 views
1 votes
1 votes
Are Full and Perfect binary tree same ?
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

369
views
1 answers
1 votes
Gopal6854 asked Sep 13, 2023
369 views
Self doubt
#include <stdio.h>void SSort(int [], int);void swap(int *,int*);int main() { int arr[] = {5,4,3,2,1,0}; int n = sizeof(arr)/sizeof(arr[0]) ... sort algorithm. But the output of the algo is: 0 0 0 0 0 0. Where is the problem ?
User Avatar
358
views
1 answers
0 votes
viral8702 asked Jul 22, 2023
358 views
Self Doubt
I have a doubt on simple Queue Implementation by an arrayAssume Queue is full(of n size),Front is pointing to first element and Rear is pointing to ... concept,I am just talking about simple queue implementation using array(Not circular).
User Avatar
1.1k
views
1 answers
0 votes
gagan55 asked Jul 13, 2023
1,107 views
self-doubt Data structure Linked list. Inserting a node at the beginning of a linked list
How to Visualize this code ?#include<stdio.h> #include<stdlib.h> struct node{ int data; struct node *next; }; void addFirst(struct node **head,int val){ ... addFirst(&head,30); addFirst(&head,40); addFirst(&head,50); printList(head); }
User Avatar
808
views
1 answers
0 votes
Abhrajyoti00 asked Oct 29, 2022
808 views
Self-Doubt: Stack Overflow in LinkedList
Can there be “Stack Overflow” in Linked list Implementation of stack? If Yes, how?
User Avatar
Link Copied!